Optimizing feature selection to improve medical diagnosis.

Redundant multicast routing in multilayer networks with shared risk resource groups Complexity

New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers.

Combinatorial Reconstruction of Half%2DSibling Groups from Microsatellite Data.
While full sibling group reconstruction from microsatellite data is a well studied problem, reconstruction of half sibling groups is much less studied, theoretically challenging, and a computationally demanding problem. In this paper, we present a formulation of the half-sibling reconstruction problem and prove it APX-hardness. We also present exact solutions for this formulation and develop heuristics. Using biological and synthetic datasets we present experimental results and compare them with the leading alternative software COLONY. We show that our results are competitive and allow half-sibling group reconstruction in the presence of polygamy, which is prevalent in nature. 1.
Bounds of redundant multicast routing problem with SRLG%2Ddiverse constraints edge

On Approximating an Implicit Cover Problem in Biology.

Integer Linear Programs for Routing and Protection Problems in Optical Networks.

Mathematical Programming for Data Mining.
Mathematical programming approaches to three fundamental problems will be described: feature selection, clustering and robust representation. The feature selection problem considered is that of discriminating between two sets while recognizing irrelevant and redundant features and suppressing them. This creates a lean model that often generalizes better to new unseen data. Computational results on real data confirm improved generalization of leaner models. Clustering is exemplified by the unsupervised learning of patterns and clusters that may exist in a given database and is a useful tool for knowledge discovery in databases (KDD). A mathematical programming formulation of this problem is proposed that is theoretically justifiable and computationally implementable in a finite number of steps. A resulting k-Median Algorithm is utilized to discover very useful survival curves for breast cancer patients from a medical database. Robust representation is concerned with minimizing trained m...
Multi%2DQuadratic Integer Programming Models and Applications.

Quadratic Integer Programming Complexity and Equivalent Forms.

Deterministic and Probabilistic Optimization Models for Data Classification.

Efficient and scalable provisioning of always%2Don multicast streaming services.
Contents lists available at ScienceDirect
Optimisation and data mining techniques for the screening of epileptic patients.

On the Integrated Production and Distribution Problem with Bidirectional Flows.

On approximating four covering and packing problems.
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from fullsibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their approximability properties differ considerably. Our inapproximability constant for the triangle packing problem improves upon the previous results in [13, 16]; this is done by directly transforming the inapproximability gap of H˚astad for the problem of maximizing the number of satisfied equations for a set of equations over GF(2) [23] and is interesting in its own right. Our approximability results on the full siblings reconstruction problems answers questions posed by Berger-Wolf et al. [4, 5] and our results on the maximum profit coverage problem provides almost matching upper and lower bounds on the approximation ratio, answering a question posed by Hassin and Or [22]. ∗ Supported by NSF grant IIS-0612044. † Supported by NSF grants DBI-0543365, IIS-0612044 and IIS-0346973.
Special Issue on Combinatorial Optimization in Data Mining.


Novel quadratic programming approach for time series clustering with biomedical application.


Novel Optimization Models for Abnormal Brain Activity Classification.

Reconstructing sibling relationships in wild populations.
I do not believe that the accident of birth makes people sisters and brothers. It makes them siblings. Gives them mutuality of parentage.. – Maya Angelou New technologies for collecting genotypic data from natural populations open the possibilities of investigating many fundamental biological phenomena, including behavior, mating systems, heritabilities of adaptive traits, kin selection, and dispersal patterns. The power and potential of genotypic information often rests in the ability to reconstruct genealogical relationships among individuals. These relationships include parentage, full and half-sibships, and higher order aspects of pedigrees. Some areas of genealogical inference, such as parentage, have been studied extensively. Although methods for pedigree inference and kinship analysis exist, most make assumptions that do not hold for wild populations of animals and plants. In this chapter, we focus on the full sibling relationship and first review existing methods for full sibship reconstructions from microsatellite genetic markers. We then describe our new combinatorial methods for sibling reconstruction based on simple Mendelian laws and its extension even in the presence of errors in the data. We also describe a generic consensus method for combining sibling reconstruction results from other methods. We present experimental comparison of the best existing approaches on both biological and simulated data. We discuss relative merits and drawbacks of existing methods and suggest a practical approach for reconstructing sibling relationships in wild populations. 1
On the Time Series K%2DNearest Neighbor Classification of Abnormal Brain Activity.

Path Protection Routing with SRLG Constraints to Support IPTV in WDM Mesh Networks.

Electroencephalogram %28EEG%29 time series classification Applications in epilepsy.

Seizure warning algorithm based on optimization and nonlinear dynamics.

A new linearization technique for multi%2Dquadratic 0%2D1 programming problems.

Statistical information approaches for the modelling of the epileptic brain.

Analysis of EEG data using optimization

Analysis of EEG data using optimization

GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows.

